The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems
نویسنده
چکیده
By reduction from the halting problem for Minsky’s two-register machines we prove that there is no algorithm capable of deciding the ∃∀∀∀-theory of one step rewriting of an arbitrary finite linear confluent finitely terminating term rewriting system (weak undecidability). We also present a fixed such system with undecidable ∃∀∗-theory of one step rewriting (strong undecidability). This improves over all previously known results of the same kind. C © 2002 Elsevier Science (USA)
منابع مشابه
Grid Structures and Undecidable Constraint Theories ?
We express conditions for a term to be a nite grid-like structure. Together with deenitions of term properties by excluding \forbid-den patterns" we obtain three new undecidability results in three areas: the 9 8-fragment of the theory of one-step rewriting for linear and shallow rewrite systems, the emptiness for automata with equality tests between rst cousins (i.e. only tests at depth 2 belo...
متن کاملDetermining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form
A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...
متن کاملGrid Structure and Undecidable Constraint Theories
We prove three new undecidability results for computational mechanisms over nite trees: There is a linear, ultra-shallow, noetherian and strongly connuent rewrite system R such that the 9 8-fragment of the rst-order theory of one-step-rewriting by R is undecidable; the emptiness problem for tree automata with equality tests between cousins is undecidable; and the 9 8-fragment of the rst-order t...
متن کاملStudy of Volumetric Flow Rate of a Micropump Using a Non-classical Elasticity Theory
The purpose of this research is to study the mechanical behavior of a micropump with clamped circular diaphragm which is the main component of drug delivery systems. In this paper, the non-linear governing equations of the circular microplate using Kirchhoff thin plate theory was been extracted based on the modified couple stress (MCST) and classical (CT) theories. Then, the non-linear equation...
متن کاملTermination of Rewriting with Right-Flat Rules Modulo Permutative Theories
We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS) whose right-hand side terms are restricted to be shallow (variables occur at depth at most one) and linear (each variable occurs at most once). Innermost termin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 175 شماره
صفحات -
تاریخ انتشار 2002